CODE 106. Remove Duplicates from Sorted Array

版权声明：本文为博主原创文章，转载请注明出处，谢谢!

版权声明：本文为博主原创文章，转载请注明出处：http://blog.jerkybible.com/2013/11/04/2013-11-04-CODE 106 Remove Duplicates from Sorted Array/

访问原文「CODE 106. Remove Duplicates from Sorted Array」

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this in place with constant memory.
For example,
Given input array A = [1,1,2],
Your function should return length = 2, and A is now [1,2].

public int removeDuplicates(int[] A) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		if (A.length <= 0) {
			return 0;
		}
		int length = A.length;
		int cur = 0;
		int nxt = 1;
		for (; nxt < A.length; nxt++) {
			if (A[nxt] != A[nxt - 1]) {
				A[cur] = A[nxt - 1];
				cur++;
			} else {
				length--;
			}
		}
		A[cur] = A[nxt - 1];
		return length;
	}